Achieving the rate-distortion bound with low-density generator matrix codes
نویسندگان
چکیده
منابع مشابه
Typical Performance of Irregular Low-Density Generator-Matrix Codes for Lossy Compression
We evaluate typical performance of irregular low-density generator-matrix (LDGM) codes, which is defined by sparse matrices with arbitrary irregular bit degree distribution and arbitrary check degree distribution, for lossy compression. We apply the replica method under one-step replica symmetry breaking (1RSB) ansatz to this problem. Typical performance of irregular LDGM codes for lossy compre...
متن کاملAchieving the Multiple Description Rate-Distortion Region with Lattice Quantization
We propose a multiple description coding scheme based on the quantization splitting method. This scheme is able to achieve the whole EGC region. For the Gaussian source, we show that any rate pair on the dominant face of the EGC region is achievable with three or fewer lattice quantizers.
متن کاملSphere-bound-achieving coset codes and multilevel coset codes
A simple sphere bound gives the best possible tradeoff between the volume per point of an infinite array and its error probability on an additive white Gaussian noise (AWGN) channel. It is shown that the sphere bound can be approached by a large class of coset codes or multilevel coset codes with multistage decoding, including certain binary lattices. These codes have structure of the kind that...
متن کاملEfficiently Decodable Low-Rate Codes Meeting Gilbert-Varshamov Bound
We demonstrate a probabilistic construction of binary linear codes meeting the GilbertVarshamov bound (with overwhelming probability) for rates up to about 10−4, together with polynomial time algorithms to perform encoding and decoding up to half the distance. This is the first such result (for some positive rate) with polynomial decoding complexity; previously a similar result (up to rate abou...
متن کاملGenerator polynomials and generator matrix for quasi cyclic codes
Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length sl with index s over the finite field F are F[y]-submodules of the ring F[x, y]/< x − 1, y − 1 >. The aim of the present paper, is to study QC codes of length sl with index s over the finite field F and find generator polynomials and generator matrix for these codes. To achieve this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2010
ISSN: 0090-6778
DOI: 10.1109/tcomm.2010.06.090203